Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
نویسندگان
چکیده
منابع مشابه
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملThe single-machine total tardiness scheduling problem: Review and extensions
0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.04.007 * Tel.: +1 305 348 3309; fax: +1 305 348 4126. E-mail address: [email protected] We review the latest theoretical developments for the single-machine total tardiness 1== T scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time appr...
متن کاملMinimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...
متن کاملA Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2010
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-009-0160-6